Edge Proximity Conditions for Extendability in Planar Triangulations
نویسندگان
چکیده
A graph G with at least 2m + 2 vertices is said to be distance d m-extendable if for any matching M of G with m edges in which the edges lie pair-wise distance at least d, there exists a perfect matching of G containing M . In this paper we prove that every 5-connected triangulation on the plane of even order is distance 3 9-extendable and distance 4 m-extendable for any m.
منابع مشابه
Edge proximity and matching extension in planar triangulations
Let G be a graph with at least 2(m+ n+1) vertices. Then G is E(m,n) if for each pair of disjoint matchings M,N ⊆ E(G) of size m and n respectively, there exists a perfect matching F in G such that M ⊆ F and F ∩N = ∅. In the present paper we wish to study property E(m,n) for the various values of integers m and n when the graphs in question are restricted to be planar. It is known that no planar...
متن کاملStabbing Line Segments with Disks: Complexity and Approximation Algorithms
Computational complexity is studied for the problem of stabbing set of straight line segments with the smallest cardinality set of disks of fixed radii r > 0 where the set of segments forms straight line drawing of planar graph. This problem along with its relatives [3] arise in physical network security analysis for telecommunication, wireless and road networks represented by geometric graphs ...
متن کاملGenerating Rooted Triangulations with Minimum Degree Four
A graph is a triangulation if it is planar and every face is a triangle. A triangulation is rooted if the external triangular face is labelled. Two rooted triangulations with the same external face labels are isomorphic if their internal vertices can be labelled so that both triangulations have identical edge lists. In this article, we show that in the set of rooted triangulations on n points w...
متن کاملProximity Search with a Triangulated Spatial Model
The proximity relations inherent in triangulations of geometric data can be exploited in the implementation of nearest-neighbour search procedures. This is relevant to applications such as terrain analysis, cartography and robotics, in which triangulations may be used to model the spatial data. Here we describe neighbourhood search procedures within constrained Delaunay triangulations of the ve...
متن کاملA New Subgraph of Minimum Weight Triangulations
In this paper, two sufficient conditions for identifying a subgraph of minimum weight triangulation of a planar point set are presented. These conditions are based on local geometric properties of an edge to be identified. Unlike the previous known sufficient conditions for identifying subgraphs, such as Keil’s β-skeleton and Yang and Xu’s double circles, The local geometric requirement in our ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Graph Theory
دوره 80 شماره
صفحات -
تاریخ انتشار 2015